Mixing Lossy and Perfect Fifo Channels
نویسندگان
چکیده
We consider asynchronous networks of finite-state systems communicating via a combination of reliable and lossy fifo channels. Depending on the topology, the reachability problem for such networks may be decidable. We provide a complete classification of network topologies according to whether they lead to a decidable reachability problem. Furthermore, this classification can be decided in polynomial-time.
منابع مشابه
Lossy Channel Games under Incomplete Information
In this paper we investigate lossy channel games under incomplete information, where two players operate on a finite set of unbounded FIFO channels and one player, representing a system component under consideration operates under incomplete information, while the other player, representing the component’s environment is allowed to lose messages from the channels. We argue that these games are ...
متن کاملRegularity Results for FIFO Channels
FIFO channel systems, in which messages between processes are cached in queues, are fundamental to the modeling of concurrency. A great deal of effort has gone into identifying scenarios where reasoning about such systems is decidable, often through establishing that the language of all channel contents is regular. Most prior results in this area focus on the effect of repetitions of individual...
متن کاملReasoning about Probabilistic Lossy Channel Systems
We consider the problem of deciding whether an innnite-state system (expressed as a Markov chain) satisses a correctness property with probability 1. This problem is, of course, undecidable for general innnite-state systems. We focus our attention on the model of proba-bilistic lossy channel systems consisting of nite-state processes that communicating over unbounded lossy FIFO channels. Abdull...
متن کاملVerifying Programs with Unreliable Channels
We consider the verification of a particular class of infinite-state systems, namely systems consisting of finite-state processes that communicate via unbounded lossy FIFO channels. This class is able to model, e.g., link protocols such as the Alternating Bit Protocol and HDLC. For this class of systems, we show that several interesting verification problems are decidable by giving algorithms f...
متن کاملOn-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
We consider symbolic on-they veriication methods for systems of nite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages representable by SREs is exactly the class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008